Pairwise-Difference Estimation of a Dynamic Optimization Model∗

نویسندگان

  • Han Hong
  • Matthew Shum
چکیده

We develop a new estimation methodology for a dynamic optimization model with unobserved shocks. We propose a pairwise-difference approach which exploits two common features of the dynamic optimization problem we consider: (1) the monotonicity of the agent’s decision (policy) function in the shocks, conditional on the observed state variables; and (2) the state-contingent nature of optimal decision-making which implies that, conditional on the observed state variables, the variation in observed choices across agents must be due to randomness in the shocks across agents. We illustrate our procedure by estimating a dynamic trading model for the milk production quota market in Ontario, Canada.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new classification method based on pairwise SVM for facial age estimation

This paper presents a practical algorithm for facial age estimation from frontal face image. Facial age estimation generally comprises two key steps including age image representation and age estimation. The anthropometric model used in this study includes computation of eighteen craniofacial ratios and a new accurate skin wrinkles analysis in the first step and a pairwise binary support vector...

متن کامل

Parameter Estimation of Loranz Chaotic Dynamic System Using Bees Algorithm

An important problem in nonlinear science is the unknown parameters estimation in Loranz chaotic system. Clearly, the parameter estimation for chaotic systems is a multidimensional continuous optimization problem, where the optimization goal is to minimize mean squared errors (MSEs) between real and estimated responses for a number of given samples. The Bees algorithm (BA) is a new member of me...

متن کامل

Introducing a new meta-heuristic algorithm based on See-See Partridge Chicks Optimization to solve dynamic optimization problems

The SSPCO (See-See Particle Chicks Optimization) is a type of swarm intelligence algorithm derived from the behavior of See-See Partridge. Although efficiency of this algorithm has been proven for solving static optimization problems, it has not yet been tested to solve dynamic optimization problems. Due to the nature of NP-Hard dynamic problems, this algorithm alone is not able to solve such o...

متن کامل

Pairwise-difference rank estimation of the transformation model

This paper considers new semiparametric estimators (called pairwise-difference rank estimators) of the coefficient vector in a transformation model. The Monte Carlo simulations, including a simulation based on wage-equation estimation, indicate that the proposed estimators perform well in small samples and exhibit substantial efficiency gains compared to existing semiparametric estimators. The ...

متن کامل

Structured Depth Prediction in Challenging Monocular Video Sequences

In this paper, we tackle the problem of estimating the depth of a scene from a monocular video sequence. In particular, we handle challenging scenarios, such as non-translational camera motion and dynamic scenes, where traditional structure from motion and motion stereo methods do not apply. To this end, we first study the problem of depth estimation from a single image. In this context, we exp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007